Solving MINLP Problems by a Penalty Framework
نویسندگان
چکیده
A penalty framework for globally solving mixed-integer nonlinear programming problems is presented. Both integrality constraints and nonlinear constraints are handled separately by hyperbolic tangent penalty functions. The preliminary numerical experiments show that the proposed penalty approach is effective and the hyperbolic tangent penalties compete with other popular penalties.
منابع مشابه
An Exact Penalty Approach for Mixed Integer Nonlinear Programming Problems
We propose an exact penalty approach for solving mixed integer nonlinear programming (MINLP) problems by converting a general MINLP problem to a finite sequence of nonlinear programming (NLP) problems with only continuous variables. We express conditions of exactness for MINLP problems and show how the exact penalty approach can be extended to constrained problems.
متن کاملConstraint partitioning in penalty formulations for solving temporal planning problems
In this paper, we study the partitioning of constraints in temporal planning problems formulated as mixed-integer nonlinear programming (MINLP) problems. Constraint partitioning is attractive because it leads to much easier subproblems, where each is a significant relaxation of the original problem. Moreover, each subproblem is very similar to the original problem and can be solved by any exist...
متن کاملAn efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
متن کاملMINLP Problems and Explanation-based Constraint Programming
Numerous industrial problems can be modelled as MINLP problems combining both numeric and integer variables. Several methods were proposed to solve these problems. But industrial applications need more than solving problems: dynamic problems, over-constrained problems, or explaining solver behaviour are features required by industrial applications. Explanation-based constraint programming offer...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کامل